| Module code | COS 210 |
| Qualification | Undergraduate |
| Faculty | Faculty of Engineering, Built Environment and Information Technology |
| Module content | This module introduces students to a framework for investigating both computability and complexity of problems. Topics include, but are not limited to: finite-state machines, regular expressions and their application in a language such as awk, the Halting problem, context-free grammars, P vs NP problem, NP-complete class, reduction techniques, regular languages, DFAs and NFAs, Lattices, Church-Turing thesis. |
| Module credits | 8.00 |
| Programmes | |
| Prerequisites | COS 110 and COS 151 |
| Contact time | 1 practical per week, 2 lectures per week |
| Language of tuition | Module is presented in English |
| Department | Computer Science |
| Period of presentation | Semester 1 |
Copyright © University of Pretoria 2024. All rights reserved.
Virtual Campus
Get Social With Us
Download the UP Mobile App